152. Maximum Product Subarray - LeetCode Solution

class Solution:
    def maxProduct(self, nums: List[int]) -> int:
        ans = nums[0]
        
        mi = nums[0]
        ma = nums[0]
        
        
        for i in range(1, len(nums), 1):
            if nums[i] <0:
                ma, mi = mi, ma
            ma = max(nums[i], ma * nums[i])
            mi = min(nums[i], mi * nums[i])
    
            ans = max(ans, ma)
        return ans